-Convolutional Codes—Part II: Structural Analysis
نویسندگان
چکیده
The structural properties of a noncoherent coded system, which incorporates convolutional codes in conjunction with multiple symbol noncoherent detection, is presented in this second part of a two-part paper, where the performance analysis was provided in Part I. These convolutional codes are referred to as nd-convolutional codes and they provide a general framework for various noncoherent coding systems, including differential systems, for several practical models of the carrier phase. The exponential rate in which the error probability decays to zero, derived in Part I of the paper, is used here to obtain the free equivalent distance of nd-codes, which is the single parameter dominating the error performance at large signal-to-noise ratios. The free equivalent distance is upper-bounded by the free nddistance, which constitutes a more convenient and practical parameter to work with, and it is the basis for a computer search for optimal nd-codes. The resultant codes of the computer search are compared to codes which are optimal for coherent detection, and it is verified that the latter codes are not necessarily optimal for noncoherent detection since they exhibit in many cases a relatively small nd-distance. The ambiguity problem, inherent to noncoherent systems, is also treated in this paper in the general framework of nd-catastrophic codes, and necessary and sufficient conditions for catastrophic error propagation are identified.
منابع مشابه
System-theoretic properties of convolutional codes over rings
Convolutional codes over rings are particularly suitable for representing codes over phase modulation signals. In order to develop a complete structural analysis of this class of codes, it is necessary to study rational matrices over rings, which constitutes the generator matrices (encoders) for such convolutional codes. Noncatastrophic, minimal, systematic and basic generator matrices are intr...
متن کاملDuality of Channel Encoding and Decoding - Part II: Rate-1 Non-binary Convolutional Codes
This is the second part of a series of papers on a revisit to the bidirectional Bahl-Cocke-JelinekRaviv (BCJR) soft-in-soft-out (SISO) maximum a posteriori probability (MAP) decoding algorithm. Part I revisited the BCJR MAP decoding algorithm for rate-1 binary convolutional codes and proposed a linear complexity decoder using shift registers in the complex number field. Part II proposes a low c...
متن کاملQuasi-cyclic unit memory convolutional codes
Unit memory convolutional codes with generator matrices, which are composed of circulant suhmatrices, are introduced. This structure facilitates the analysis as well as an efficient search for good codes. Equivalences among such codes and consider some of the basic structural properties are discussed. In particular, catastrophic encoders and minimal encoders are characterized and dual codes tre...
متن کاملAn Efficient Attack of a McEliece Cryptosystem Variant Based on Convolutional Codes
Löndahl and Johansson proposed last year a variant of the McEliece cryptosystem which replaces Goppa codes by convolutional codes. This modification is supposed to make structural attacks more difficult since the public generator matrix of this scheme contains large parts which are generated completely at random. They proposed two schemes of this kind, one of them consists in taking a Goppa cod...
متن کاملConvolutional Codes Over Rings
Convolutional codes over rings behave quite differently from convolutional codes over fields, but they are the ones best suited for phase modulation. This behavior depends strongly on the structure of the underlying ring. Some basic concepts about ring convolutional codes, in particular over Zpr , and their structural properties such as basicity, systematicity, non-catastrophicity and minimalit...
متن کامل